Structured Document Algebra in Action
نویسندگان
چکیده
A Structured Document Algebra (SDA) defines modules with variation points and how such modules compose. The basic operations are module addition and replacement. Repeated addition can create nested module structures. SDA also allows the decomposition of modules into smaller parts. In this paper we show how SDA modules can be used to deal algebraically with Software Product Lines (SPLs). In particular, we treat some fundamental concepts of SPLs, such as refinement and refactoring. This leads to mathematically precise formalization of fundamental concepts used in SPLs, which can be used for improved Feature-Oriented Software Development (FOSD) tooling.
منابع مشابه
Exploiting Query Structure and Document Structure to Improve Document Retrieval Effectiveness
In this paper we present a systematic analysis of document retrieval using unstructured and structured queries within the score region algebra (SRA) structured retrieval framework. The behavior of different retrieval models, namely Boolean, tf.idf, GPX, language models, and Okapi, is tested using the transparent SRA framework in our three-level structured retrieval system called TIJAH. The retr...
متن کاملThe Accessibility Dimension for Structured Document Retrieval
Structured document retrieval aims at retrieving the document components that best satisfy a query, instead of merely retrieving pre-de ned document units. This paper reports on an investigation of a tf -idf -acc approach, where tf and idf are the classical term frequency and inverse document frequency, and acc, a new parameter called accessibility, that captures the structure of documents. The...
متن کاملAn Algebra for Structured Text Search and a Framework for its Implementation
A query algebra is presented that expresses searches on structured text. In addition to traditional full-text boolean queries that search a pre-defined collection of documents, the algebra permits queries that harness document structure. The algebra manipulates arbitrary intervals of text, which are recognized in the text from implicit or explicit markup. The algebra has seven operators, which ...
متن کاملAdjunctions between Hom and Tensor as endofunctors of (bi-) module category of comodule algebras over a quasi-Hopf algebra.
For a Hopf algebra H over a commutative ring k and a left H-module V, the tensor endofunctors V k - and - kV are left adjoint to some kinds of Hom-endofunctors of _HM. The units and counits of these adjunctions are formally trivial as in the classical case.The category of (bi-) modules over a quasi-Hopf algebra is monoidal and some generalized versions of Hom-tensor relations have been st...
متن کاملQuery Optimization for Structured Documents Based on Knowledgeon the Document Type De nition
Declarative access mechanisms for structured document collections and for semi-structured data are becoming increasingly important. In this article, using a rule-based approach for query optimization and applying it to such queries, we deploy knowledge on the Document Type Deenition (DTD) to formulate transformation rules for query-algebra terms. Specii-cally, we look at rules that save navigat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015